Equitable Revisited
نویسندگان
چکیده
The randomized k-paging algorithm Equitable given by Achlioptas et al. is Hk-competitive and uses O(k 2 log k) memory. This competitive ratio is best possible. The randomized algorithm RMark given by Fiat et al. is (2Hk − 1)-competitive, but only uses O(k) memory. Borodin and El Yaniv [6] list as an open question whether there exists an Hk-competitive randomized algorithm which requires O(k) memory for k-paging. In this paper we answer this question in the affirmative by giving a modification of Equitable.
منابع مشابه
Equitability Revisited: Why the ‘‘Equitable Threat Score’’ Is Not Equitable
In the forecasting of binary events, verification measures that are ‘‘equitable’’ were defined by Gandin and Murphy to satisfy two requirements: 1) they award all random forecasting systems, including those that always issue the same forecast, the same expected score (typically zero), and 2) they are expressible as the linear weighted sum of the elements of the contingency table, where the weig...
متن کاملBetter Ways to Cut a Cake - Revisited
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compared. For 2 persons, cut-and-choose, while envy-free and efficient, limits the cutter to exactly 50% if he or she is ignorant of the chooser’s preferences, whereas the chooser can generally obtain more. By comparison, a new 2person surplus procedure (SP’), which induces the players to be truthful ...
متن کاملTHE EQUITABLE DOCTRINE OF UNDUE INFLUENCE CONSIDERED IN THE CONTEXT OF SPIRITUAL INFLUENCE AND RELIGIOUS FAITH: ALLCARD v SKINNER REVISITED IN AUSTRALIA
The equitable doctrine of undue influence allows for the rescission of a gift or contract arising out of a relationship of influence between the transacting parties. The doctrine applies in two ways. The first application is through ‘actual undue influence’ where it must be proved that one party unconscionably used their position of significant influence in the relationship to secure the transa...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کامل